Branch-and-Price for a European variant of the Railroad Blocking Problem

نویسندگان

  • Robert Voll
  • Uwe Clausen
چکیده

In wagonload traffic, a production form in railway freight traffic, small groups of wagons have to be transported. In order to decrease transportation costs, wagons from different relations are consolidated. In railyards trains can be separated and rearranged to new trains. The costs arising from this process, which is called reclassification, must be balanced with the transportation costs. The minimization of total costs can be formulated as a network optimization model. We introduce a branch-and-price approach for the considered problem. Moreover, we present specialized cuts, which can be incorporated into the branching scheme. Solutions obtained from our implementation can keep up with results computed by CPLEX.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A population-based algorithm for the railroad blocking problem

Railroad blocking problem (RBP) is one of the problems that need an important decision in freight railroads. The objective of solving this problem is to minimize the costs of delivering all commodities by deciding which inter-terminal blocks to build and by specifying the assignment of commodities to these blocks, while observing limits on the number and cumulative volume of the blocks assemble...

متن کامل

European and American put valuation via a high-order semi-discretization scheme

Put options are commonly used in the stock market to protect against the decline of the price of a stock below a specified price. On the other hand, finite difference approach is a well-known and well-resulted numerical scheme for financial differential equations. As such in this work, a new spatial discretization based on finite difference semi-discretization procedure with high order of accur...

متن کامل

A three-stage assembly flow shop scheduling problem with blocking and sequence-dependent set up times

This paper considers a three-stage assembly flowshop scheduling problem with sequence-dependent setup < /div> times at the first stage and blocking times between each stage in such a way that the weighted mean completion time and makespan are minimized. Obtaining an optimal solution for this type of complex, large-sized problem in reasonable computational time using traditiona...

متن کامل

The multi-vehicle traveling purchaser problem with pairwise incompatibility constraints and unitary demands: A branch-and-price approach

In this work we study a suppliers selection and routing problem where a fleet of homogeneous vehicles with a predefined capacity is available for procuring different products from different suppliers with the aim to minimize both the traveling and the purchasing costs. Decisions are further complicated by the presence of pairwise incompatibility constraints among products, implying the impossib...

متن کامل

Closed formulas for the price and sensitivities of European options under a double exponential jump diffusion model

We derive closed formulas for the prices of European options andtheir sensitivities when the underlying asset follows a double-exponentialjump diffusion model, as considered by S. Kou in 2002. This author hasderived the option price by making use of double series where each termrequires the computation of a sequence of special functions, such thatthe implementation remains difficult for a large...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Electronic Notes in Discrete Mathematics

دوره 41  شماره 

صفحات  -

تاریخ انتشار 2013